Asymptotically Efficient Estimation of Location for a Symmetric Stable Law
نویسندگان
چکیده
منابع مشابه
Delay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems
In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...
متن کاملAsymptotically efficient estimation of spectral moments
This paper studies parametric estimation of spectral moments of a zero-mean complex Gaussian stationary process immersed in independent Gaussian noise. With the merit of the maximum-likelihood (ML) approach as motivation, this work exploits a Whittle’s type objective function able to capture the relevant features of the log-likelihood function, while being much more manageable. The resulting es...
متن کاملAsymptotically Efficient Estimation of Spectral Moments
Abstmet-This correspondence studies parametric estimatioll of spectral moments of a zero-mean complex Gaussian stationary pmcess immersed in independent Gaussian noise. With the merit of the maximum-likelihood @lL) approach as motivation, this work exploits a Whittle's type objective function that is able to capture the relevant feabues of the log-likelihmdfunction while b e i i much more manag...
متن کاملLinear Parameter Estimation : Asymptotically Efficient Adaptive Strategies
This paper considers the problem of distributed adaptive linear parameter estimation in multiagent inference networks. Local sensing model information is only partially available at the agents, and interagent communication is assumed to be unpredictable. The paper develops a generic mixed time-scale stochastic procedure consisting of simultaneous distributed learning and estimation, in which th...
متن کاملSymmetric and Asymptotically Symmetric Permutations
We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A “pattern” in a permutation σ is the order type of the restriction of σ : [n] → [n] to a subset S ⊂ [n]. First, is it possible for the pattern counts in a permutation to be exactly equal to their expected values under a uniform distribution? Attempts to address this question ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1976
ISSN: 0090-5364
DOI: 10.1214/aos/1176343644